Im 31000 -01 Advanced Problem Solving and Programming for Informatics Instructor: Jacques ChansavangIm 31000 -01 Advanced Problem Solving and Programming for Informatics Instructor: Jacques Chansavang
New topics include arrays, file I/O, fundamentals of object-oriented programming, and development of user-defined classes, advanced gui programming, graphics, and presentation of visual data. Reinforcement of problem-solving techniques
25.86 Kb. 1
read
Course Assessment ReportCourse Assessment Report
A passing student shall be able to understand a computer as an instruction interpreter, to have an in depth understanding of the run-time environment of a running program
Report 296.14 Kb. 3
read
CS115 Object-Oriented Programming I 2 Credit HoursCS115 Object-Oriented Programming I 2 Credit Hours
Designed for students who have had little or no prior experience with computer programming. For students in cs and cs-related degree programs
9.43 Kb. 1
read
New Degree, Major, or SubmajorNew Degree, Major, or Submajor
Note: You must receive approval from System to plan a new Degree or Major
24.7 Kb. 1
read
CS480 Artificial Intelligence Planning and Control 3 Credit HoursCS480 Artificial Intelligence Planning and Control 3 Credit Hours
These include heuristic search, knowledge representation, constraint satisfaction, probabilistic reasoning, decision-theoretic control, and sensor interpretation. Particular focus will be places on real-world application of the material
9.99 Kb. 1
read
Course outline: cs 462 “Artificial Intelligence” / cs 570 “Topics in Artificial Intelligence” cs 462 2016/17 Catalog dataCourse outline: cs 462 “Artificial Intelligence” / cs 570 “Topics in Artificial Intelligence” cs 462 2016/17 Catalog data
Ligence as a coherent body of ideas and methods to acquaint the student with the basic programs in the field and their underlying theory
20.25 Kb. 1
read
Tcss 343 Master Syllabus Version: April 2011 (Approved: 27 May 2011) Catalog DescriptionTcss 343 Master Syllabus Version: April 2011 (Approved: 27 May 2011) Catalog Description
Includes efficient algorithms, models of computation, correctness, time and space complexity, np-complete problems, and undecidable problems. Prerequisite: a minimum grade of 0 in tcss 322; a minimum grade of 0 in tcss 342
12.52 Kb. 1
read
Uaa computer Science & Engineering Advisory Board Meeting AgendaUaa computer Science & Engineering Advisory Board Meeting Agenda
Dr. Witmer is teaching a class on Geospatial Programming, if you think anyone from your organization would be interested in taking it, please see the attached syllabus
20.09 Kb. 1
read

  1




The database is protected by copyright ©ininet.org 2024
send message

    Main page